Chaotic Potts Spin Model for Combinatorial Optimization Problems

نویسندگان

  • Shin Ishii
  • Masa-aki Sato
چکیده

In this paper we first show some of the bifurcation properties of Potts mean-field-theory annealing applied to traveling salesman problems. Due to these bifurcation properties, this approach, in general, produces non-optimal and non-unique solutions. As an alternative approach, we propose a nonequilibrium version of the Potts spin neural network, called chaotic Potts spin (CPS). CPS has several parameters, and bifurcations over each parameter are investigated. Next, experimental results are shown comparing CPS with several related approaches. CPS is good at obtaining optimal solutions for small-scale problems and semi-optimal solutions for relatively large-scale problems. We also describe a couple of CPS modifications: CPS with a heuristic method and CPS with a "chaotic annealing" method. These modified algorithms can produce even better CPS solutions. Copyright 1997 Elsevier Science Ltd.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : c on d - m at / 9 50 50 20 v 1 4 M ay 1 99 5 Frustration - how it can be measured

A misfit parameter is used to characterize the degree of frustration of ordered and disordered systems. It measures the increase of the ground-state energy due to frustration in comparison with that of a relevant reference state. The misfit parameter is calculated for various spin-glass models. It allows one to compare these models with each other. The extension of this concept to other combina...

متن کامل

Numerical Algorithm to Hardware Implementation {

| We review the approaches for solving combinatorial optimization problems by chaotic dynamics. We mention both numerical algorithms with chaotic neural networks and hardware implementation. I. Chaos for avoiding local minima A. Mutual Connection Neural Network Dynamics Various methods are proposed for solving NP-hard combinatorial optimization problems, for example, traveling salesman problem ...

متن کامل

Average properties of combinatorial problems and thermodynamics of spin models on graphs

The study of thermodynamic properties of classical spin models on infinite graphs naturally leads to consider the new combinatorial problems of random-walks and percolation on the average. Indeed, spin models with O n continuous symmetry present spontaneous magnetization only on transient on the average graphs, while models with discrete symmetry (Ising and Potts) are spontaneously magnetized o...

متن کامل

A New Method for Mapping Optimization Problemsonto Neural

A novel modiied method for obtaining approximate solutions to diicult optimization problems within the neural network paradigm is presented. We consider the graph partition and the travelling salesman problems. The key new ingredient is a reduction of solution space by one dimension by using graded neurons, thereby avoiding the destructive redundancy that has plagued these problems when using s...

متن کامل

Combinatorial Optimization with Feedback Artiicial Neural Networks

A brief review is given for using feedback artiicial neural networks (ANN) to obtain good approximate solutions to combinatorial optimization problems. The key element is the mean eld approximation (MFT) The methodology, which is illustrated for the graph bisection and knapsack problems, is easily generalized to Potts systems. The latter is related to the deformable templates method, which is i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neural networks : the official journal of the International Neural Network Society

دوره 10 5  شماره 

صفحات  -

تاریخ انتشار 1997